Recursive computation of minimum-length polygons
Identifieur interne : 001703 ( Main/Exploration ); précédent : 001702; suivant : 001704Recursive computation of minimum-length polygons
Auteurs : Gisela Klette [Nouvelle-Zélande]Source :
- Computer vision and image understanding : (Print) [ 1077-3142 ] ; 2013.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Robotique.
English descriptors
- KwdEn :
Abstract
The relative convex hull, or the minimum-perimeter polygon (MPP) of a simple polygon A, contained in a second polygon B, is a unique polygon in the set of nested polygons between A and B. The computation of the minimum-length polygon (MLP), as a special case for isothetic polygons A and B, is useful for various applications in image analysis and robotics. The paper discusses the first recursive approach to compute the relative convex hull for the general case of simple polygons A and B, following an earlier publication by the author, and it derives a (methodologically more simple) algorithm to compute the MLP for the special case of isothetic polygons. The recursive algorithm for the isothetic case allows us to create rooted trees for digitized measurable sets S c 2. Those trees are useful for the characterization of digital convexity.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000075
- to stream PascalFrancis, to step Curation: 000932
- to stream PascalFrancis, to step Checkpoint: 000049
- to stream Main, to step Merge: 001720
- to stream Main, to step Curation: 001703
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Recursive computation of minimum-length polygons</title><author><name sortKey="Klette, Gisela" sort="Klette, Gisela" uniqKey="Klette G" first="Gisela" last="Klette">Gisela Klette</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>AUT University, Private Bag 92006</s1><s2>Auckland 1142</s2><s3>NZL</s3><sZ>1 aut.</sZ></inist:fA14><country>Nouvelle-Zélande</country><wicri:noRegion>Auckland 1142</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">13-0182236</idno><date when="2013">2013</date><idno type="stanalyst">PASCAL 13-0182236 INIST</idno><idno type="RBID">Pascal:13-0182236</idno><idno type="wicri:Area/PascalFrancis/Corpus">000075</idno><idno type="wicri:Area/PascalFrancis/Curation">000932</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000049</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000049</idno><idno type="wicri:doubleKey">1077-3142:2013:Klette G:recursive:computation:of</idno><idno type="wicri:Area/Main/Merge">001720</idno><idno type="wicri:Area/Main/Curation">001703</idno><idno type="wicri:Area/Main/Exploration">001703</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Recursive computation of minimum-length polygons</title><author><name sortKey="Klette, Gisela" sort="Klette, Gisela" uniqKey="Klette G" first="Gisela" last="Klette">Gisela Klette</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>AUT University, Private Bag 92006</s1><s2>Auckland 1142</s2><s3>NZL</s3><sZ>1 aut.</sZ></inist:fA14><country>Nouvelle-Zélande</country><wicri:noRegion>Auckland 1142</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Computer vision and image understanding : (Print)</title><title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title><idno type="ISSN">1077-3142</idno><imprint><date when="2013">2013</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Computer vision and image understanding : (Print)</title><title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title><idno type="ISSN">1077-3142</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer vision</term><term>Convex hull</term><term>Convexity</term><term>Edge detection</term><term>Image analysis</term><term>Image processing</term><term>Image segmentation</term><term>Morphological analysis</term><term>Optimal trajectory</term><term>Path planning</term><term>Perimeter</term><term>Polygon</term><term>Recursive algorithm</term><term>Robotics</term><term>Shortest path</term><term>Tree(graph)</term><term>Treeing</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Polygone</term><term>Analyse image</term><term>Traitement image</term><term>Robotique</term><term>Plus court chemin</term><term>Détection contour</term><term>Vision ordinateur</term><term>Périmètre</term><term>Arborescence</term><term>Trajectoire optimale</term><term>Analyse morphologique</term><term>Enveloppe convexe</term><term>Algorithme récursif</term><term>Arbre graphe</term><term>Convexité</term><term>Planification trajectoire</term><term>Segmentation image</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Robotique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The relative convex hull, or the minimum-perimeter polygon (MPP) of a simple polygon A, contained in a second polygon B, is a unique polygon in the set of nested polygons between A and B. The computation of the minimum-length polygon (MLP), as a special case for isothetic polygons A and B, is useful for various applications in image analysis and robotics. The paper discusses the first recursive approach to compute the relative convex hull for the general case of simple polygons A and B, following an earlier publication by the author, and it derives a (methodologically more simple) algorithm to compute the MLP for the special case of isothetic polygons. The recursive algorithm for the isothetic case allows us to create rooted trees for digitized measurable sets S c <sup>2</sup>. Those trees are useful for the characterization of digital convexity.</div></front></TEI><affiliations><list><country><li>Nouvelle-Zélande</li></country></list><tree><country name="Nouvelle-Zélande"><noRegion><name sortKey="Klette, Gisela" sort="Klette, Gisela" uniqKey="Klette G" first="Gisela" last="Klette">Gisela Klette</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001703 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001703 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:13-0182236
|texte= Recursive computation of minimum-length polygons
}}
| This area was generated with Dilib version V0.6.33. |  |